Automated Theorem Proving in Projective Geometry with Bracket Algebra
نویسندگان
چکیده
We present a method which can produce readable proofs for theorems of constructive type involving points, lines and conics in projective geometry. The method extends Wu’s method to bracket algebra and develops the area method of Chou, Gao and Zhang in the framework of projective geometry.
منابع مشابه
Automated Theorem Proving in the Homogeneous Model with Clifford Bracket Algebra
A Clifford algebra has three major multiplications: inner product, outer product and geometric product. Accordingly, the same Clifford algebra has three versions: Clifford vector algebra, which features on inner products and outer products of multivectors; Clifford bracket algebra, which features on pseudoscalars and inner products of vectors; Clifford geometric algebra, which features on geome...
متن کاملAlgebraic Representation, Elimination and Expansion in Automated Geometric Theorem Proving
Cayley algebra and bracket algebra are important approaches to invariant computing in projective and affine geometries, but there are some difficulties in doing algebraic computation. In this paper we show how the principle “breefs” – bracketoriented representation, elimination and expansion for factored and shortest results, can significantly simply algebraic computations. We present several t...
متن کاملAutomated short proof generation for projective geometric theorems with Cayley and bracket algebras: II. Conic geometry
In this paper we study plane conic geometry, particularly different representations of geometric constructions and relations in plane conic geometry, with Cayley and bracket algebras. We propose three powerful simplification techniques for bracket computation involving conic points, and an algorithm for rational Cayley factorization in conic geometry. The factorization algorithm is not a genera...
متن کاملAutomated Theorem Proving in Incidence Geometry - A Bracket Algebra Based Elimination Method
In this paper we propose a bracket algebra based elimination method for automated generation of readable proofs for theorems in incidence geometry. This method is based on two techniques, the first being some heuristic elimination rules which improve the performance of the area method of Chou et al. (1994) without introducing signed length ratios, the second being a simplification technique cal...
متن کاملA Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry
This paper presents a formalization of Grassmann-Cayley algebra [6] that has been done in the Coq [2] proof assistant. The formalization is based on a data structure that represents elements of the algebra as complete binary trees. This allows to define the algebra products recursively. Using this formalization, published proofs of Pappus’ and Desargues’ theorem [7,1] are interactively derived....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006